Computing Science Group ABSTRACTION FRAMEWORK FOR MARKOV DECISION PROCESSES AND PCTL VIA GAMES
نویسندگان
چکیده
ION FRAMEWORK FOR MARKOV DECISIONPROCESSES AND PCTL VIA GAMES Mark Kattenbelt Michael Huth
منابع مشابه
Verification and Refutation of Probabilistic Specifications via Games
We develop an abstraction-based framework to check probabilistic specifications of Markov Decision Processes (MDPs) using the stochastic two-player game abstractions (i.e. “games”) developed by Kwiatkowska et al. as a foundation. We define an abstraction preorder for these game abstractions which enables us to identify many new game abstractions for each MDP — ranging from compact and imprecise...
متن کاملStrategy Synthesis for Markov Decision Processes and Branching-Time Logics
We consider a class of finite -player games (Markov decision processes) where the winning objectives are specified in the branching-time temporal logic qPECTL (an extension of the qualitative PCTL ). We study decidability and complexity of existence of a winning strategy in these games. We identify a fragment of qPECTL called detPECTL for which the existence of a winning strategy is decidable i...
متن کاملCounterexample-Guided Abstraction Refinement for POMDPs
We study a sound and complete counterexampleguided abstraction refinement (CEGAR) framework for partially observable Markov decision processes (POMDPs). This framework allows automatic reasoning to find a proper abstraction for POMDPs and reduce model checking complexity. A safety fragment of Probabilistic Computation Tree Logic (PCTL), safePCTL, with the finite horizon is considered as system ...
متن کاملIt Usually Works: The Temporal Logic of Stochastic Systems
In this paper the branching time logic pCTL is deened. pCTL expresses quantitative bounds on the probabilities of correct behavior ; it can be interpreted over discrete Markov processes. A bisim-ulation relation is deened on nite Markov processes, and shown to be sound and complete with respect to pCTL. We extend the universe of models to generalized Markov processes in order to support notions...
متن کاملTableaux for Policy Synthesis for MDPs with PCTL* Constraints
Markov decision processes (MDPs) are the standard formalism for modelling sequential decision making in stochastic environments. Policy synthesis addresses the problem of how to control or limit the decisions an agent makes so that a given specification is met. In this paper we consider PCTL*, the probabilistic counterpart of CTL*, as the specification language. Because in general the policy sy...
متن کامل